Anatomy of the Parallel Tree Based Strategy for High Strength Interaction Testing

نویسنده

  • Mohammad F. J. Klaib
چکیده

Software and hardware testers concentrate on how to minimize the time involved in testing at the same time to ensure that the system is also tested well and made acceptable. This paper has enhanced and explained in details our previous strategy “A Tree Based Strategy for Test Data Generation and Cost Calculation for Pairwise Combinatorial Interaction Testing” to work effectively in parallel and to go beyond pairwise testing. The proposed strategy can now support a parallel 2-way and general multi-way combinatorial interaction test data generation based on two algorithms; a parallel tree generation algorithm which generates the test cases and a parallel T-way cost calculation algorithm which is used in constructing test suites with minimum number of test cases. Both strategies have been explained here in details. Keywords— Parallel algorithms, Software testing, Hardware testing, Multi-way testing

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anatomy of the Tree Based Strategy for High Strength Interaction Testing

The amount of resources consumed for a complete and exhaustive testing becomes unreasonable and unaffordable. While it is vital to assure the quality and the reliability of any system, it is impossible to do an exhaustive testing due to the huge number of possible combinations. To bring a balance between exhaustive testing and lack of testing combinatorial interactions testing has been adopted....

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A fast wallace-based parallel multiplier in quantum-dot cellular automata

Physical limitations of Complementary Metal-Oxide-Semiconductors (CMOS) technology at nanoscale and high cost of lithography have provided the platform for creating Quantum-dot Cellular Automata (QCA)-based hardware. The QCA is a new technology that promises smaller, cheaper and faster electronic circuits, and has been regarded as an effective solution for scalability problems in CMOS technolog...

متن کامل

A fast wallace-based parallel multiplier in quantum-dot cellular automata

Physical limitations of Complementary Metal-Oxide-Semiconductors (CMOS) technology at nanoscale and high cost of lithography have provided the platform for creating Quantum-dot Cellular Automata (QCA)-based hardware. The QCA is a new technology that promises smaller, cheaper and faster electronic circuits, and has been regarded as an effective solution for scalability problems in CMOS technolog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015